Jacobian Smoothing Inexact Newton Method for Ncp with a Special Choice of Forcing Parameters
نویسنده
چکیده
The inexact Newton method with a special choice of forcing parameters is proposed for solving nonlinear complementarity problems. This method belongs to the class of Jacobian smoothing methods. Linear system is solved approximately in every iteration. The sequence of forcing terms controls the accuracy level of the approximate solution and influences the behavior of the method. Globalization strategy is based on nonmonotone rule. AMS Mathematics Subject Classification (2000): 65H10 ; 90C33
منابع مشابه
Globally convergent Jacobian smoothing inexact Newton methods for NCP
A new smoothing algorithm for the solution of nonlinear complementarity problems (NCP) is introduced in this paper. It is based on semismooth equation reformulation of NCP by Fischer–Burmeister function and its related smooth approximation. In each iteration the corresponding linear system is solved only approximately. Since inexact directions are not necessarily descent, a nonmonotone techniqu...
متن کاملSemilocal and global convergence of the Newton-HSS method for systems of nonlinear equations
Newton-HSS methods, that are variants of inexact Newton methods different from Newton-Krylov methods, have been shown to be competitive methods for solving large sparse systems of nonlinear equations with positive definite Jacobian matrices [Bai and Guo, 2010]. In that paper, only local convergence was proved. In this paper, we prove a Kantorovich-type semilocal convergence. Then we introduce N...
متن کاملChoosing the Forcing Terms in an Inexact Newton Method
An inexact Newton method is a generalization ofNewton's method for solving F(x) 0, F n _ _ in, in which, at the kth iteration, the step sk from the current approximate solution xk is required to satisfy a condition F (x) + F'(xk) sk _< F(x)II for a "forcing term" r/ [0, 1). In typical applications, the choice of the forcing terms is critical to the efficiency of the method and can affect robust...
متن کاملInexact Block Quasi - Newton Methods for Sparsesystems of Nonlinear Equations
In this paper we present the results obtained in solving consistent sparse systems of n nonlinear equations F(x) = 0; by a Quasi-Newton method combined with a p block iterative row-projection linear solver of Cimmino-type, 1 p n: Under weak regularity conditions for F; it is proved that this Inexact Quasi-Newton method has a local, linear convergence in the energy norm induced by the preconditi...
متن کاملA globally convergent inexact Newton method with a new choice for the forcing term
In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step sk of the Newton’s system J (xk)s =−F(xk) is found. This means that sk must satisfy a condition like ‖F(xk) + J (xk)sk‖ ≤ ηk‖F(xk)‖ for a forcing term ηk ∈ [0,1). Possible choices for ηk have already been presented. In this work, a new choice for ηk is proposed. The method is globalized using a ro...
متن کامل